Shortest path reoptimization vs resolution from scratch: a computational comparison
نویسندگان
چکیده
The Shortest Path Problem (SPP) is among the most studied problems in Operations Research, for its theoretical aspects but also because it appears as sub-problem many combinatorial optimization ...
منابع مشابه
Finding the K shortest hyperpaths using reoptimization
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an ...
متن کاملComputational Efficiency of Optimized Shortest Path Algorithms
The main purpose of this study is to evaluate the computational efficiency of optimized shortest path algorithms. Our study establishes the relative order of the shortest path algorithms with respect to their known computational efficiencies is not significantly modified when the algorithms are adequately coded. An important contribution of this study is the inclusion of the re-distributive hea...
متن کاملShortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy. In this work, we introduce a new methodology for evaluating speed-up tech...
متن کاملA comparison of solution strategies for biobjective shortest path problems
We consider the biobjective shortest path (BSP) problem as the natural extension of the single objective shortest path problem. BSP problems arise in various applications where networks usually consist of large numbers of nodes and arcs. Since obtaining the set of efficient solutions to a BSP problem is more difficult (i.e. NP-hard and intractable) than solving the corresponding single objectiv...
متن کاملComputational Efficiency of Shortest Path Algorithms in C Language
The main purpose of this study is to evaluate the computational efficiency of algorithms for calculating shortest paths when they are correctly coded by using the C programming language. This paper thoroughly measures the benefit of using the C programming language for coding shortest path algorithms. For each algorithm, we suggest computer implementation that take full advantage of the pointer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods & Software
سال: 2021
ISSN: ['1055-6788', '1026-7670', '1029-4937']
DOI: https://doi.org/10.1080/10556788.2021.1895153